Analysis of Interior-Point Paths
نویسنده
چکیده
Infeasible-interior-point paths are the main tools in interior-point methods for solving many kinds of optimization problems. These paths are usually parametrized by a penalty-parameter r ↓ 0 and further parameters describing their off-centrality and infeasiblilty. Starting with an early result of C. Witzgall et al. [12] in linear programming, this paper gives an overview on results concerning the existence of these paths, their analyticity and the limiting behavior of their derivatives as r ↓ 0, and this also for degenerate problems in the areas of linear programming, linear complementarity problems, and semi-definte programming.
منابع مشابه
Underlying Paths in Interior Point Method for Monotone Semidefinite Linear Complementarity Problem
An interior point method (IPM) defines a search direction at an interior point of the feasible region. These search directions form a direction field which in turn defines, as the unique solution of a system of ordinary differential equations (ODEs), a curve passing through any interior point. We call such curves off-central paths (the central path is trivial for analysis; our concern is off-ce...
متن کاملLimiting Behavior and Analyticity of Two Special Types of Infeasible Weighted Central Paths in Semidefinite Programming
The central path is the most important concept in the theory of interior point methods. It is an analytic curve in the interior of the feasible set which tends to an optimal point at the boundary. The analyticity properties of the paths are connected with the analysis of the superlinear convergence of the interior point algorithms for semidefinite programming. In this paper we study the analyti...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملUnderlying paths in interior point methods for the monotone semidefinite linear complementarity problem
An interior point method (IPM) defines a search direction at each interior point of the feasible region. The search directions at all interior points together form a direction field, which gives rise to a system of ordinary differential equations (ODEs). Given an initial point in the interior of the feasible region, the unique solution of the ODE system is a curve passing through the point, wit...
متن کامل